Boolean inequations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Treatment of Boolean Equations and Inequations

We are given a set of equations and inequations over some boolean variables; henceforth, we call each equation and inequation a fact. An equation is written as x ∼ y, denoting that x and y are known to be equal, and an inequation as x | y, denoting that x and y are known to be unequal (note that ∼ and | are mutually exclusive, though they are not negations of each other, because no relationship...

متن کامل

Omega-almost Boolean rings

In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.

متن کامل

Boolean complexes and boolean numbers

The Bruhat order gives a poset structure to any Coxeter group. The ideal of elements in this poset having boolean principal order ideals forms a simplicial poset. This simplicial poset defines the boolean complex for the group. In a Coxeter system of rank n, we show that the boolean complex is homotopy equivalent to a wedge of (n− 1)-dimensional spheres. The number of these spheres is the boole...

متن کامل

Conjugacy Classes of Solutions to Equations and Inequations over Hyperbolic Groups

We study conjugacy classes of solutions to systems of equations and inequations over torsion-free hyperbolic groups, and describe an algorithm to recognize whether or not there are finitely many conjugacy classes of solutions to such a system. The class of immutable subgroups of hyperbolic groups is introduced, which is fundamental to the study of equations in this context. We apply our results...

متن کامل

Boolean matching based on Boolean unification

We consider the problem of detecting the equivalence of two single-output Boolean functions , considering the permutation and complementation of their inputs, complementation of outputs, and their associated don't-care sets. This is often referred to as the Boolean matching problem. Boolean matching is a veriication problem, and it has important applications in logic synthesis problems such as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2007

ISSN: 0012-365X

DOI: 10.1016/j.disc.2006.07.006